dynamic coloring of graph
thesis
- وزارت علوم، تحقیقات و فناوری - دانشگاه الزهراء - دانشکده علوم پایه
- author ماریا رحمانی
- adviser نسرین سلطانخواه
- Number of pages: First 15 pages
- publication year 1391
abstract
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم در رابطه ی ?_2 (g)-?(g)?2 صدق می کنند.اکبری و بقیه ثابت کردند که تمام گراف های دو بخشی –kمنتظم و گراف های قویاً منتظم در حدس مونت گمری صدق می کنند. همچنین مونت گمری ثابت کرد اگر g یک گراف باشد به طوری که ?(g)?3، آنگاه ?_2 (g)??(g)+1. در فصل آخر تعمیمی از رنگ آمیزی دینامیکی بیان شده است.
similar resources
Dynamic Graph Coloring
In this paper we study the number of vertex recolorings that an algorithm needs to perform in order to maintain a proper coloring of a graph under insertion and deletion of vertices and edges. We present two algorithms that achieve different trade-offs between the number of recolorings and the number of colors used. For any d > 0, the first algorithm maintains a proper O(CdN)-coloring while rec...
full textDynamic Algorithms for Graph Coloring
We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for (∆ + 1)vertex coloring and (2∆ − 1)-edge coloring in a graph with maximum degree ∆. It is natural to ask if we can efficiently maintain such colorings in the dynamic setting as well. We get the following th...
full textEffective and Efficient Dynamic Graph Coloring
Graph coloring is a fundamental graph problem that is widely applied in a variety of applications. The aim of graph coloring is to minimize the number of colors used to color the vertices in a graph such that no two incident vertices have the same color. Existing solutions for graph coloring mainly focus on computing a good coloring for a static graph. However, since many real-world graphs are ...
full textAutomatic Service Composition Based on Graph Coloring
Web services as independent software components are published on the Internet by service providers and services are then called by users’ request. However, in many cases, no service alone can be found in the service repository that could satisfy the applicant satisfaction. Service composition provides new components by using an interactive model to accelerate the programs. Prior to service comp...
full textA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
full textAutomatic Service Composition Based on Graph Coloring
Web services as independent software components are published on the Internet by service providers and services are then called by users’ request. However, in many cases, no service alone can be found in the service repository that could satisfy the applicant satisfaction. Service composition provides new components by using an interactive model to accelerate the programs. Prior to service comp...
full textMy Resources
document type: thesis
وزارت علوم، تحقیقات و فناوری - دانشگاه الزهراء - دانشکده علوم پایه
Keywords
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023